Relational Markov Games
نویسندگان
چکیده
Towards a compact and elaboration-tolerant first-order representation of Markov games, we introduce relational Markov games, which combine standard Markov games with first-order action descriptions in a stochastic variant of the situation calculus. We focus on the zero-sum two-agent case, where we have two agents with diametrically opposed goals. We also present a symbolic value iteration algorithm for computing Nash policy pairs in this framework.
منابع مشابه
Counting-MLNs: Learning Relational Structure for Decision Making
Many first-order probabilistic models can be represented much more compactly using aggregation operations such as counting. While traditional statistical relational representations share factors across sets of interchangeable random variables, representations that explicitly model aggregations also exploit interchangeability of random variables within factors. This is especially useful in decis...
متن کاملEssays in Cooperation and Repeated Games
This dissertation explores cooperation when formal contracts and legal institutions are imperfect. The first chapter (co-authored with Isaiah Andrews) considers how a principal allocates business among a group of agents to motivate them in the context of a repeated game with imperfect private monitoring. If players are impatient, the optimal relational contract dynamically allocates future busi...
متن کاملSome Remarks on Equilibria in Semi-markov Games
This paper is a first study of correlated equilibria in nonzerosum semi-Markov stochastic games. We consider the expected average payoff criterion under a strong ergodicity assumption on the transition structure of the games. The main result is an extension of the correlated equilibrium theorem proven for discounted (discrete-time) Markov games in our joint paper with Raghavan. We also provide ...
متن کاملApplying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games
We define and examine priority mean-payoff games — a natural extension of parity games. By adapting the notion of Blackwell optimality borrowed from the theory of Markov decision processes we show that priority mean-payoff games can be seen as a limit of special multi-discounted games.
متن کاملTrading Expressivity for Efficiency in Statistical Relational Learning
Statistical relational learning (SRL) combines state-of-the-art statistical modeling with relational representations. It thereby promises to provide effective machine learning techniques for domains that cannot adequately be described using a propositional representation. Driven by new applications in which data is structured, interrelated, and heterogeneous, this area of machine learning has r...
متن کامل